Ranking results of searches of databases

ABSTRACT

A computer system is configured to receive a plurality of previous user selection by a user of previous database entries, each of which has as plurality of database field. The computer system is configured to analyze the plurality of previous user selections to identify how frequently the same values are included in the various previous database entries. The computer system is configured to determine weights for the various database fields and rank subsequent search results for a subsequent search of the database based on the determined weights.

This application claims the benefit of U.S. Prov. Appl. No. 62/902,345filed on Sep. 18, 2019, which is incorporated by reference herein in itsentirety.

BACKGROUND Technical Field

This disclosure relates generally to ranking results from a search of adatabase.

Description of the Related Art

Databases can be used to store vast amounts of data. In many instances,if a user desires to access a particular entry of a database, he or sheperforms a search of the database. Such a search is likely to return aplurality of matches for the search criteria. When a user searches adatabase, the computer system performing the search decides the order inwhich information that is responsive to the search is presented to theuser. Such ordering may be performed in any of a number of ways.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating an embodiment of a computersystem configured to rank search results in accordance with variousembodiments.

FIGS. 2A-2B are expanded block diagrams of the various components ofFIG. 1 in accordance with various embodiments.

FIG. 3 is an example of entries in a database in accordance with variousembodiments.

FIG. 4A is an example of a record of a series of access to variousentries in the database made by a particular user in accordance with thedisclosed embodiments.

FIG. 4B is an example table of field weights and field value weightsused to ranking search results in accordance with the disclosedembodiments.

FIGS. 5A-5C are examples of ranked search results in accordance with thedisclosed embodiments.

FIG. 6 is a flowchart illustrating an embodiment of a search rankingmethod in accordance with the disclosed embodiments.

FIG. 7 is a flowchart illustrating an embodiment of a search rankingmethod in accordance with the disclosed embodiments.

FIG. 8 is a block diagram of an exemplary computer system, which mayimplement the various components of FIGS. 1, 2A, and 2B.

This disclosure includes references to “one embodiment” or “anembodiment.” The appearances of the phrases “in one embodiment” or “inan embodiment” do not necessarily refer to the same embodiment.Particular features, structures, or characteristics may be combined inany suitable manner consistent with this disclosure.

Within this disclosure, different entities (which may variously bereferred to as “units,” “circuits,” other components, etc.) may bedescribed or claimed as “configured” to perform one or more tasks oroperations. This formulation—[entity] configured to [perform one or moretasks]—is used herein to refer to structure (i.e., something physical,such as an electronic circuit). More specifically, this formulation isused to indicate that this structure is arranged to perform the one ormore tasks during operation. A structure can be said to be “configuredto” perform some task even if the structure is not currently beingoperated. A “computer system configured to rank search results” isintended to cover, for example, a computer system has circuitry thatperforms this function during operation, even if the computer system inquestion is not currently being used (e.g., a power supply is notconnected to it). Thus, an entity described or recited as “configuredto” perform some task refers to something physical, such as a device,circuit, memory storing program instructions executable to implement thetask, etc. This phrase is not used herein to refer to somethingintangible. Thus, the “configured to” construct is not used herein torefer to a software entity such as an application programming interface(API).

The term “configured to” is not intended to mean “configurable to.” Anunprogrammed FPGA, for example, would not be considered to be“configured to” perform some specific function, although it may be“configurable to” perform that function and may be “configured to”perform the function after programming.

Reciting in the appended claims that a structure is “configured to”perform one or more tasks is expressly intended not to invoke 35 U.S.C.§ 112(f) for that claim element. Accordingly, none of the claims in thisapplication as filed are intended to be interpreted as havingmeans-plus-function elements. Should Applicant wish to invoke Section112(f) during prosecution, it will recite claim elements using the“means for” [performing a function] construct.

As used herein, the terms “first,” “second,” etc. are used as labels fornouns that they precede, and do not imply any type of ordering (e.g.,spatial, temporal, logical, etc.) unless specifically stated. Forexample, references to “first” and “second” database entries would notimply an ordering between the two unless otherwise stated.

As used herein, the term “based on” is used to describe one or morefactors that affect a determination. This term does not foreclose thepossibility that additional factors may affect a determination. That is,a determination may be solely based on specified factors or based on thespecified factors as well as other, unspecified factors. Consider thephrase “determine A based on B.” This phrase specifies that B is afactor is used to determine A or that affects the determination of A.This phrase does not foreclose that the determination of A may also bebased on some other factor, such as C. This phrase is also intended tocover an embodiment in which A is determined based solely on B. As usedherein, the phrase “based on” is thus synonymous with the phrase “basedat least in part on.”

As used herein, the word “module” refers to structure that stores orexecutes a set of operations. A module refers to hardware thatimplements the set of operations, or a memory storing the set ofinstructions such that, when executed by one or more processors of acomputer system, cause the computer system to perform the set ofoperations. A module may thus include an application-specific integratedcircuit implementing the instructions, a memory storing the instructionsand one or more processors executing said instructions, or a combinationof both.

DETAILED DESCRIPTION

Referring now to FIG. 1, a block diagram of an exemplary embodiment of acomputer system 100 is depicted. In various embodiments, computer system100 is configured to receive a search request 122 from a user 120 andprepare search results 110 based on the search request 122 and a rankingof the search matches by computer system 100. In various embodiments,computer system 100 includes weight module 106 and search module 108 aswell as one or more database 102 that are being search and a record ofprevious database accesses by user 120.

In various embodiments, computer system 100 is implemented using one ormore computer systems (e.g., computer servers, desktop computers, laptopcomputer, tablet computers, a cloud of computers, or a combination) thatstore data, receive user input (e.g., user selections of entries indatabase 102, search request 122), and present output to users (e.g.,search results 110). In various embodiments, computer system 100maintains one or more databases 102. Database 102 includes a pluralityof entries having various values in various fields of the database. Invarious embodiments, computer system 100 is a multi-tenant computersystem having a plurality of tenants. In such embodiments, portions ofdatabase 102 are allocated to each of the plurality of tenants such thattenants are not able to access other tenants' information in database102. As discussed herein in further detail in connection to FIG. 3, somefields of database 102 are standardized fields that are used by multipletenants, but some fields of database 102 are custom fields that areaccessible only to a particular tenant.

User 120 is a human user accessing the computer system 100 who requestssearch request 122 in various embodiments. In various embodiments wherecomputer system 100 is a multi-tenant computer system, user 120 isassociated with a particular tenant. In such embodiments, user 120 canaccess some or all of the portion of database 102 allocated to theparticular tenant, but user 120 cannot access portions of database 102allocated to other tenants (unless the other tenants allow such access).

In various embodiments, the record of previous database accesses 104 isa record of the previous database entries accessed by a particular user120. In various embodiments, the size of this record varies. In someembodiments, the last few hundred databases access are recorded andanalyzed as discussed herein. In various embodiments, by analyzing onlythe most recent (e.g., the two hundred most recent) database entriesselected by user 120, computer system 100 may be better able to estimatethe recent affinities of user 120 without the previous access historypotentially influencing the ranking of search results in a way thatmakes the ranking of search results 110 less relevant to the user's 120current affinities. For example, if a user 120 has been accessingdatabase 102 for six months as part of a role associated with a firstregion of the country (and was therefore accessing database entriesassociated with the first region) but starting one month ago is nowdoing work associated with a second region of the country (and istherefore now accessing database entries associated with the secondregion), factoring in the previous six months' worth of database entriesmay elevate irrelevant search results associated with the first region.As another example, if a user 120 typically services customers in afirst industry (e.g., the high-tech industry) but was asked to fill infor another user's rule and is now temporarily servicing customers in asecond industry (e.g., the healthcare industry), the more recentaccesses by user 120 will likely reflect the change. Moreover, becausethe previous database access 104 are analyzed and not, for example, arecord about the user 120 himself or herself (e.g., their humanresources file) such changes in behavior do not need to be recorded inan official file for the change in behavior to be detected and used torank search results. Thus, if user 120 is usually based in Texas andsells to customers based in Texas, but embarks on a sales trip toCalifornia to sell to customers in California (and is accessing databaseentries associated with California), the fact that the user's 120address record with human resources says “Texas” will not affect thesearch results 110. The functions of weight module 106 and search module108 are discussed in further detail herein in reference to FIGS. 2A and2B.

In various embodiments, the disclosed techniques enable computer system100 to rank search results 110 for search request 122 based on aplurality of previous database accesses 104 by user 120. As discussed infurther detail herein, by ranking search results based on an analysis ofthe previous database entries accessed by user 120, computer system 100is able to better anticipate the particular search results that,according to a model trained using the previous database accesses 104,are predicted to be most relevant to user 120 and to move these searchresults to toward the top of the list of search results 110. Because theanalysis discussed herein is based on weights calculated based on therecent selections made by the user 120, the ranking of the searchresults 110 is more likely to reflect the current activities of user120. Moreover, because the analysis techniques discussed herein arebased on the frequency of same values appearing in database entriesselected by user 120, computer system 100 does not need to have anunderstanding of the meaning of the contents of the various databasefields. If, for example, a particular database field is a custom fieldfor the flavors of ice creams purchased by customers who are recorded ina database, computer system 100 does not need to understand thesignificance of vanilla versus chocolate ice cream. Instead, computersystem 100 determines the frequency of appearances of vanilla versuschocolate in database entries selected by user 120 (e.g., 80% vanillaand 20% chocolate) and, using this frequency, determines that user 120has a higher affinity for vanilla and boosts results associated withvanilla accordingly. For example, if a user searches for “Acme” and twosearch results are identified, a first “Acme” associated with vanillaand a second “Acme” associated with chocolate, the Acme associated withvanilla will be ranked ahead of the Acme associated with chocolate insearch results 110. Thus, in various embodiments, the different fieldvalue weights determined for a user 120 is based on the relativefrequency of various values in the field throughout the record ofprevious database accesses 104.

In various embodiments, the disclosed techniques are also useable todetermine which database fields are predicted to be more relevant touser 120 in evaluating a list of search results 110 to identify aparticular database entry being sought. If a first field is weightedhigher than a second field, search matches in the first field will beranked higher than search matches in the second field. For example, if auser searches for “Acme” and “Acme” appears in a first result with“Acme” in the Company Name field and a second result with “Acme” in the“Address” field, the first result will be ranked higher when the CompanyName field has a greater weight than the Address field. Similarly, if auser searches for “Acme” and there are two search matches: a first“Acme” that is associated with vanilla ice cream and Texas and a second“Acme” that is associated with chocolate ice cream and California, theorder of the two Acmes will be determined by the weight of the fieldvalues (e.g., vanilla versus chocolate, Texas versus California) and theweight of the fields (e.g., ice cream flavor versus location). The fieldweight may be determined by various factors including but not limited toa frequency of database entries in the record of previous databaseaccesses 104 in which the most frequently-selected field value for thatuser 120 (or other users associated with the same tenant) is present,whether the database field is included in the customize search resultsview for user 120 or the tenant with which user 120 is associated, suchfrequencies and/or customized search results for other users and/orother tenant, or any combination.

Referring now to FIG. 2A, an expanded block diagram of weight module 106is depicted. The record of previous database accesses 104 is maintainedby a cache maintenance module 200 in various embodiments. In suchembodiments, cache maintenance module 200 adds accesses to the recordwhen user 120 accesses database entries (e.g., via accessing a databaseentry as a result of a search through database 102) and, in embodiments,removes accesses from the record of previous database accesses 104(e.g., after a certain amount of time, in a first-in, first-out cachingparadigm in which the oldest access is removed when a new access isadded).

In various embodiments, weight module 106 includes a field valuedistribution determination module 212, a machine learning model 210, afield weight module 214, and a field value weight module 216. In variousembodiments, field value distribution determination module 212 isexecutable to analyze the record of previous database accesses 104 anddetermines the frequency of various same values of the various fields ofthe record (e.g., the number of times “vanilla” and “chocolate” occur inthe Ice Cream Flavor field in database accesses in user's 120 record ofprevious database accesses 104). In various embodiments, field valuedistribution determination module 212 is also is executable to analyzethe frequency in which the user's 120 most frequently selected fieldvalue for each particular field is present in each particular databaseaccess (e.g., the frequency which the most common field value “vanilla”occurs in the “Ice Cream” field in all of the database entries selectedby user 120 in the record of previous database accesses 104).

In various embodiments, machine learning model 210 receives thefrequencies calculated by field value distribution determination module212 and also receives an indication 211 of which field value areincluded in the search result layout for user 120 (and/or the tenantwith which user 120 is associated). In various embodiments, machinelearning model 210 receives field value frequencies and search resultconfiguration indications for other users (including users associatedwith the same tenant as user 120 and/or users associated with othertenants). Machine learning model 210 is any of a number of iterativemachine learning algorithms in various embodiments, and may be trainedwith the data received once at the outset, regularly, or every time auser 120 access a database entry. Machine learning model 210 generatesfield weights for the various database fields in records selected byuser 120 as recorded in previous database accesses 104 and outputs thefield weights to field weight module 214. Field value weight module 216is executable to receive the frequencies from field value distributiondetermination module 212 and uses the frequencies to calculate fieldvalue weights. In various embodiments, field value weight module 216 isexecutable to transform the frequencies (e.g., a logarithmictransformation, an exponential transformation, a multiplicativetransformation) as part of calculating the field value weights.

Referring now to FIG. 2B, an expanded block diagram of search module 108is depicted. Database search module 220 is executable to receive searchrequest 122 and perform a search of database 102. In variousembodiments, database search module 220 is executable to perform any ofa number of suitable searches including full match semantic searches,partial match semantic searches, searches for specific database fields,searches with Boolean operators, etc. Regardless of the type of searchperformed, database search module 220 is executable to output a set ofsearch results to search ranking module 222. In various embodiments,database search module 220 is executable to automatically search forresults as user 120 is entering a search phrase to automaticallycomplete the search phrase with the highest ranked result. For example,referring to FIG. 5A, the highest ranked result is “Acme Grocery, Inc.”In this instance, as user 120 types “Acme” in a search text box,database search module 220 is executable, in various embodiments, toperform the search for “Acme” while and to automatically complete thephase “Acme Grocery, Inc.” in the search text box while user 120 istyping.

Search ranking module 222 is executable to rank various search resultsthat have been output by database search module 220 using field valueweights and/or field weights output by field value weight module 216 andfield weight module 214, respectively. In various embodiments, thesearch results are ranked by a total score for each search resultcalculated using the following formula:Total=(Field Value Weight₁)×(Field Weight₁)+(Field Value Weight₂)×(FieldWeight₂) . . . +(Field Value Weight_(n))×(Field Weight_(n))

In various other embodiments, search results may be ranked according toother calculations including but not limited to the average (Field ValueWeight)×(Field Weight) for the search result, the median (Field ValueWeight)×(Field Weight) for the search result, etc. Search results 110are prepared and ordered according to the rank calculated by searchranking module 222.

Referring now to FIGS. 3, 4A, 4B, 5A, and 5B, a simple example of adatabase 102, record of previous database accesses 104, calculatedweights, and search results are depicted. Referring now to FIG. 3, adatabase of twelve database entries of the Customer Name of variouscustomers, their Location, the Contact person for the customer, theNearest Sales Office, and the Purchased Flavor is depicted. While onlytwelve total database entries with six database fields are depicted, itwill be understood that database 102 may include hundreds, thousands, ormillions (or any number) of database records and tens or hundreds (orany number) of database fields in various embodiments. The database 102depicted in FIG. 3 may be associated with a particular tenant of amulti-tenant system with access restricted to just the users designatedby the particular tenant. In various embodiments, some database fieldssuch as Customer Name and Location are common across the multi-tenantdatabase and Nearest Sales Office and Purchased Flavor are custom fieldsfor a particular tenant. As discussed herein, the various weightingtechniques disclosed herein are agnostic to the meaning of the variousvalues in the various fields in various embodiments.

Referring now to FIG. 4A, a record of previous database accesses 104 ofthe five most recent database accesses by user 120 are shown. Asdiscussed herein, the record may include any number of previous databaseaccesses (e.g., tens, hundreds, thousands). Various repeated values inthe record of previous database accesses 104 shown in FIG. 4A are shownin bold typeface or italic typeface. As discussed herein, for example,“Vanilla” is present in four out of five previous database accesses(e.g., 80%) in the Purchased Flavor database field and “New York” ispresent in three out of five previous database access (e.g., 60%).

Referring now to FIG. 4B, a table 400 showing field weights and fieldvalue weights for the various fields and field values is shown. ThePurchased Flavor database field, for example, has been assigned a weightof 4 (e.g., the greatest weight in table 400) according to thedetermination of computer system 100 (e.g., by machine learning model210 and field weight module 214). The various field value weights areindicated below and are calculated based on the frequency of theparticular value in the record of previous database accesses 104depicted in FIG. 4A. Thus, “Vanilla” has a weight of 0.8 and “New York”has a weight of 0.6, for example.

Referring now to FIGS. 5A-5C various search results 110 prepared fromthe database 102 depicted in FIG. 3 for various search requests 122 areshown. Referring now to FIG. 5A, at block 502, user 120 has searched for“Acme.” There are four search results shown in results 500. Based on theweights shown in FIG. 4B, computer system 100 has ranked the result forAcme Grocery, Inc. first because of the weights of Vanilla in thePurchased Flavor field and Austin in the Location field. Acme Ice CreamTrucks is ranked next because of the weight of Vanilla in the PurchasedFlavor field and Acme Ice Cream Parlor is ranked third because of theweight of New York in the Nearest Sales Office field.

Referring now to FIG. 5B, at block 512, user 120 has searched for“Austin.” There are four search results shown in results 510. AcmeGrocer, Inc. is ranked first, again, because of the weight of Vanilla inthe Purchased Flavor field.

Referring now to FIG. 5C, at block 522, user 120 has searched for“Colonial.” Here, the search results fields have been customized and aredifferent than FIGS. 5A and 5B, excluding the “Contact” field.Accordingly, the weights for one or more of the field values is adjustedaccordingly such that fields that appear in the customized searchresults field have greater weight than field that do not appear. Here,Colonial Food Delivery is ranked first because of the weight of Bostonin the Location field.

Referring now to FIG. 6, a flowchart illustrating an embodiment of asearch ranking method 600 is shown. In various embodiments, the variousactions associated with method 600 are performed with computer system100. At block 602, computer system 100 collects information identifyprevious database entries (e.g., stored as previous database accesses104) of database 102 selected by user 120. In various embodiments, thecollected information identifies values of a particular database fieldincluded in the database entries (e.g., in database 102) selected byuser 120. At block 604, computer system 100 analyzes the collectedinformation to identify, for the particular database field, howfrequently the same values of the particular field are included in thedatabase entries selected by user 120. At block 606, based on theanalyzing, computer system 100 determines one or more weights for theparticular database field. In various embodiments, the one or moreweights affect a ranking of a search result 110 based on a matchassociated with the particular database field. At block 608, computersystem 100 ranks subsequent search results 110 for a search of thedatabase 102 based on the determined weights for the particular databasefield and one or more weights determined for other database fields inthe database 102.

Referring now to FIG. 7, a flowchart illustrating an embodiment of asearch ranking method 700 is shown. In various embodiments, the variousactions associated with method 700 are performed with computer system100. At block 702, computer system 100 receives a plurality of previoususer selections (e.g., previous database accesses 104) by user 120 ofprevious database entries of a database 102 having a plurality ofdatabase fields. At block 704, computer system 100 analyzes theplurality of previous user selections to identify, for a particulardatabase field, how frequently the same values of the particular fieldare included in the previous database entries selected by user 120. Atblock 706, computer system 100 determines, based on the analyzing, aweight for the particular database field. At block 708, computer system100 ranks subsequent search results 110 for a subsequent search of thedatabase 102 based on the determined weight for the particular databasefield being greater than one or more weights determined for otherdatabase fields in the database 102.

Exemplary Computer System

Turning now to FIG. 8, a block diagram of an exemplary computer system800, which may implement the various components of computer system 100(e.g., database 102, weight module 106. search module 108) is depicted.Computer system 800 includes a processor subsystem 880 that is coupledto a system memory 820 and I/O interfaces(s) 840 via an interconnect 860(e.g., a system bus). I/O interface(s) 840 is coupled to one or more I/Odevices 850. Computer system 800 may be any of various types of devices,including, but not limited to, a server system, personal computersystem, desktop computer, laptop or notebook computer, mainframecomputer system, tablet computer, handheld computer, workstation,network computer, a consumer device such as a mobile phone, musicplayer, or personal data assistant (PDA). Although a single computersystem 800 is shown in FIG. 8 for convenience, system 800 may also beimplemented as two or more computer systems operating together.

Processor subsystem 880 may include one or more processors or processingunits. In various embodiments of computer system 800, multiple instancesof processor subsystem 880 may be coupled to interconnect 860. Invarious embodiments, processor subsystem 880 (or each processor unitwithin 880) may contain a cache or other form of on-board memory.

System memory 820 is usable to store program instructions executable byprocessor subsystem 880 to cause system 800 perform various operationsdescribed herein. System memory 820 may be implemented using differentphysical memory media, such as hard disk storage, floppy disk storage,removable disk storage, flash memory, random access memory (RAM-SRAM,EDO RAM, SDRAM, DDR SDRAM, RAMBUS RAM, etc.), read only memory (PROM,EEPROM, etc.), and so on. Memory in computer system 800 is not limitedto primary storage such as memory 820. Rather, computer system 800 mayalso include other forms of storage such as cache memory in processorsubsystem 880 and secondary storage on I/O Devices 850 (e.g., a harddrive, storage array, etc.). In some embodiments, these other forms ofstorage may also store program instructions executable by processorsubsystem 880.

I/O interfaces 840 may be any of various types of interfaces configuredto couple to and communicate with other devices, according to variousembodiments. In one embodiment, I/O interface 840 is a bridge chip(e.g., Southbridge) from a front-side to one or more back-side buses.I/O interfaces 840 may be coupled to one or more I/O devices 850 via oneor more corresponding buses or other interfaces. Examples of I/O devices850 include storage devices (hard drive, optical drive, removable flashdrive, storage array, SAN, or their associated controller), networkinterface devices (e.g., to a local or wide-area network), or otherdevices (e.g., graphics, user interface devices, etc.). In oneembodiment, computer system 800 is coupled to a network via a networkinterface device 850 (e.g., configured to communicate over WiFi,Bluetooth, Ethernet, etc.).

Although specific embodiments have been described above, theseembodiments are not intended to limit the scope of the presentdisclosure, even where only a single embodiment is described withrespect to a particular feature. Examples of features provided in thedisclosure are intended to be illustrative rather than restrictiveunless stated otherwise. The above description is intended to cover suchalternatives, modifications, and equivalents as would be apparent to aperson skilled in the art having the benefit of this disclosure.

The scope of the present disclosure includes any feature or combinationof features disclosed herein (either explicitly or implicitly), or anygeneralization thereof, whether or not it mitigates any or all of theproblems addressed herein. Accordingly, new claims may be formulatedduring prosecution of this application (or an application claimingpriority thereto) to any such combination of features. In particular,with reference to the appended claims, features from dependent claimsmay be combined with those of the independent claims and features fromrespective independent claims may be combined in any appropriate mannerand not merely in the specific combinations enumerated in the appendedclaims.

What is claimed is:
 1. A method comprising: collecting, by a computersystem, information identifying previous database entries of a databaseselected by a user, wherein the collected information identifies valuesof a particular database field included in the database entries selectedby the user; analyzing, by the computer system, the collectedinformation to identify, for the particular database field, howfrequently the same values of the particular field are included in thedatabase entries selected by the user; based on the analyzing,determining, by the computer system, one or more weights for theparticular database field, wherein the one or more weights affect aranking of a search result based on a match associated with theparticular database field; and ranking, by the computer system,subsequent search results for a search of the database based on thedetermined one or more weights for the particular database field and oneor more weights determined for other database fields in the database. 2.The method of claim 1, wherein the one or more weights for theparticular database field include one or more field value weights forparticular values in the particular field and an overall field valueweight; wherein the one or more field value weights are based on thefrequency of the particular values in the particular database field inthe collected information; and wherein the overall field value weight isbased on the frequency of the greatest weighted of the particular valuesin the collected information.
 3. The method of claim 1, furthercomprising: receiving, at the computer system, one or more customizedsearch result layout settings specifying that one or more specifieddatabase fields are displayed to the user when the search results aredisplayed; wherein one or more weights for the particular database fieldare further based on the customized search result layout settings. 4.The method of claim 1, further comprising receiving, at the computersystem, a string of characters input by the user; and determining, withthe computer system, a predicted search request based on the inputtedstring of characters; wherein the search of the database is performedbased on the predicted search request without a command from the userindicating that the string of characters is complete.
 5. The method ofclaim 4, wherein determining the predicted search request is furtherbased on the determined one or more weights for the particular databasefield and one or more weights determined for other database fields inthe database.
 6. The method of claim 1, further comprising: storing, atthe computer system, metadata about the user including a first locationassociated with the user; wherein the same values of the particularfield are indicative of a second location that is remote from the firstlocation, and wherein the ranking includes ranking the subsequent searchresults such that search results indicative of the second location areranked higher than search results indicative of the first location. 7.The method of claim 1, further comprising: receiving, at the computersystem, a user selection of one of the search results; and updating,with the computer system, the collected information for use in rankingsecond search results for a second subsequent search by addinginformation identifying the selected one of the subsequent searchresults to the collected information and removing informationidentifying the database entry selected by the user the longest timeago.
 8. The method of claim 1, wherein the computer system is amulti-tenant computer system having a plurality of tenants; wherein theuser is associated with a particular tenant of the plurality of tenants;and wherein the particular database field is a custom database fieldaccessible only to the particular tenant.
 9. The method of claim 1,wherein the computer system is a multi-tenant computer system having aplurality of tenants, wherein the user is associated with a particulartenant of the plurality of tenants, and wherein a second user isassociated with the particular tenant; the method further comprising:determining, by the computer system, weights for database fields in thedatabase based on search activity of the second user; wherein thedetermined weights for database fields in the database associated withthe user differ from the determined weights for database fields in thedatabase associated with the second user.
 10. The method of claim 1,wherein the subsequent search of the database is performed based on asearch request for information not stored in the particular field. 11.The method of claim 1, wherein determining the one or more weights forthe particular database field is based only on how frequently the samevalues of the particular field are included in the database entriesselected by the user relative to how frequently other values of otherdatabase fields in the database are included in the database entriesselected by the user.
 12. A non-transitory computer-readable mediumhaving program instructions stored thereon that are executable by acomputer system to cause the computer system to perform operationscomprising: collecting, by the computer system, information identifyingprevious database entries of a database selected by a user, wherein thecollected information identifies values of a first database fieldincluded in the database entries selected by the user and values of asecond database field included in the database entries selected by theuser; analyzing, by the computer system, the collected information to:identify, for the first database field, how frequently the same valuesof the first field are included in the database entries selected by theuser, and identify, for the second database field, how frequently thesame values of the second field are included in the database entriesselected by the user; and based on the analyzing, determining, by thecomputer system, a first weight for the first database field and asecond weight for the second database field, wherein the first weightaffects a ranking of a first search result based on a first matchassociated with the first database field and the second weight affect aranking of a second search result based on a second match associatedwith the second database field.
 13. The computer-readable medium ofclaim 12, the operations further comprising: ranking subsequent searchresults for a subsequent search of the database based on the firstweight and the second weight; wherein the ranking includes: rankingsearch results associated with the first database field above searchresults associated with the second database field when the first weightis greater than the second weight; and ranking search results associatedwith the second database field above search results associated with thefirst database field when the second weight is greater than the firstweight.
 14. The computer-readable medium of claim 12, the operationsfurther comprising: ranking subsequent search results for a subsequentsearch of the database based on the first weight and the second weights;wherein the ranking includes: ranking search results associated withboth the first database field and second database field above searchresults associated just the first database field or just the seconddatabase field.
 15. The computer-readable medium of claim 12, theoperations further comprising: receiving one or more customized searchresult layout settings specifying that one or more specified databasefields are displayed to the user when the search results are displayed;wherein the first weight and second weight are further based on thecustomized search result layout settings.
 16. The computer-readablemedium of claim 12, wherein the computer system is a multi-tenantcomputer system have a plurality of tenants; wherein the user isassociated with a particular tenant of the plurality of tenants; andwherein the first database field and second database field are customdatabase fields accessible only to the particular tenant.
 17. A methodcomprising: receiving, at a computer system, a plurality of previoususer selections by a user of previous database entries of a databasehaving a plurality of database fields; analyzing, by the computersystem, the plurality of previous user selections to identify, for aparticular database field, how frequently the same values of theparticular field are included in the previous database entries selectedby the user; based on the analyzing, determining, by the computersystem, a weight for the particular database field; and ranking, by thecomputer system, subsequent search results for a subsequent search ofthe database based on the determined weight for the particular databasefield being greater than one or more weights determined for otherdatabase fields in the database.
 18. The method of claim 17, wherein thecomputer system is a multi-tenant computer system having a plurality oftenants; wherein the user is associated with a particular tenant of theplurality of tenants; and wherein the particular database field is acustom database field accessible only to the particular tenant.
 19. Themethod of claim 17, further comprising: receiving, at the computersystem, one or more customized search result layout settings specifyingthat one or more specified database fields are displayed to the userwhen the search results are displayed; wherein the ranking is furtherbased on the customized search result layout settings.
 20. The method ofclaim 17, wherein determining the weight for the particular databasefield is based only on how frequently the same values of the particularfield are included in the search results selected by the user relativeto how frequently other values of other database fields in the databaseare included in the search results.